SSMA: simplified slime mould algorithm for optimization wireless sensor network coverage problem
نویسندگان
چکیده
Wireless sensor network (WSN) coverage problem is to think about how maximize the obtain reliable monitoring and tracking services with guaranteed quality of service. In this paper, a simplified slime mould algorithm (SSMA) for solving WSN proposed. SSMA, we mainly conducted 13 groups WSNs optimization experiments compared them six well-known meta-heuristic algorithms. The experimental results Wilcoxon rank-sum test show that proposed SSMA generally competitive, outstanding performance effectiveness. We could be helpful effectively control nodes energy, improve perceived extend survival time.
منابع مشابه
Improved Differential Evolution Algorithm for Wireless Sensor Network Coverage Optimization
In order to serve for the ecological monitoring efficiency of Poyang Lake, an improved hybrid algorithm, mixed with differential evolution and particle swarm optimization, is proposed and applied to optimize the coverage problem of wireless sensor network. And then, the affect of the population size and the number of iterations on the coverage performance are both discussed and analyzed. The fo...
متن کاملSlime mould tactile sensor
Slime mould P. polycephalum is a single cells visible by unaided eye. The cells shows a wide spectrum of intelligent behaviour. By interpreting the behaviour in terms of computation one can make a slime mould based computing device. The Physarum computers are capable to solve a range of tasks of computational geometry, optimisation and logic. Physarum computers designed so far lack of localised...
متن کاملMaximizing Coverage Problem Using Genetic Algorithm in Wireless Sensor Network
Sensor networks, which consist of sensor nodes each capable of sensing environment and transmitting data, have lots of applications in battlefield surveillance, environmental monitoring, industrial diagnostics, etc. Coverage which is one of the most important performance metrics for sensor networks reflects how well a sensor field is monitored. In this paper, we introduce the maximum coverage d...
متن کاملWireless sensor network design through genetic algorithm
In this paper, we study WSN design, as a multi-objective optimization problem using GA technique. We study the effects of GA parameters including population size, selection and crossover method and mutation probability on the design. Choosing suitable parameters is a trade-off between different network criteria and characteristics. Type of deployment, effect of network size, radio communication...
متن کاملGame Theoretical Algorithm for Coverage Optimization in Wireless Sensor Networks
Game Theory is fundamentally and applicably addressed and incorporated to analyze the coverage problems in Wireless Sensor Networks (WSN) in this paper. GCC (Game-theoretical Complete Coverage) algorithm is used to ensure whole network coverage mainly through adjusting the covering range of nodes and controlling the network redundancy. Hereafter, by designing suitable cost and utility function ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems Science & Control Engineering
سال: 2022
ISSN: ['2164-2583']
DOI: https://doi.org/10.1080/21642583.2022.2084650